Common Principal Components for Dependent Random Vectors

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Detecting influential observations in principal components and common principal components

Detecting outlying observations is an important step in any analysis, even when robust estimates are used. In particular, the robustified Mahalanobis distance is a natural measure of outlyingness if one focuses on ellipsoidal distributions. However, it is well known that the asymptotic chi-square approximation for the cutoff value of the Mahalanobis distance based on several robust estimates (l...

متن کامل

Functional common principal components models

In this paper, we discuss the extension to the functional setting of the common principal component model that has been widely studied when dealing with multivariate observations. We provide estimators of the common eigenfunctions and study their asymptotic behavior.

متن کامل

Common Functional Principal Components 1

Functional principal component analysis (FPCA) based on the Karhunen–Loève decomposition has been successfully applied in many applications, mainly for one sample problems. In this paper we consider common functional principal components for two sample problems. Our research is motivated not only by the theoretical challenge of this data situation, but also by the actual question of dynamics of...

متن کامل

Common Hyperplane Medians for Random Vectors

xpm -x and necessarily splits in K[X] into distinct first degree factors so that Da is diagonalizable. Applying this to Dg, for Ek = {x: [g, x] = kx}, we have Eo K and D = YEk, where the sum is direct and taken over all k E K with Ek # 0. Now, if x E D *, gx xg kx for some k E K is equivalent to requiring that x belong to N *. Moreover, y E Ek is equivalent to y E Kx. Then each Ek is a K-subspa...

متن کامل

Asymptotics for dependent sums of random vectors

We consider sequences of length m of n-tuples each with k non-zero entries chosen randomly from an Abelian group or finite field. For what values of m does there exist a subsequence which is zero-sum or linearly dependent respectively? We report some results relating to these problems.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Multivariate Analysis

سال: 2000

ISSN: 0047-259X

DOI: 10.1006/jmva.2000.1908